Functional data analysis by matrix completion
نویسندگان
چکیده
منابع مشابه
Colorization by Matrix Completion
Given a monochrome image and some manually labeled pixels, the colorization problem is a computer-assisted process of adding color to the monochrome image. This paper proposes a novel approach to the colorization problem by formulating it as a matrix completion problem. In particular, taking a monochrome image and parts of the color pixels (labels) as inputs, we develop a robust colorization mo...
متن کاملGraph Matrix Completion in Presence of Outliers
Matrix completion problem has gathered a lot of attention in recent years. In the matrix completion problem, the goal is to recover a low-rank matrix from a subset of its entries. The graph matrix completion was introduced based on the fact that the relation between rows (or columns) of a matrix can be modeled as a graph structure. The graph matrix completion problem is formulated by adding the...
متن کاملAlgorithms for Matrix Completion by Yu Xin
We consider collaborative filtering methods for matrix completion. A typical approach is to find a low rank matrix that matches the observed ratings. However, the corresponding problem has local optima. In this thesis, we study two approaches to remedy this issue: reference vector method and trace norm regularization. The reference vector method explicitly constructs user and item features base...
متن کاملMatrix Completion by the Principle of Parsimony
Dempster’s covariance selection method is extended first to general nonsingular matrices and then to full rank rectangular matrices. Dempster observed that his completion solved a maximum entropy problem. We show that our generalized completions are also solutions of a suitable entropy-like variational problem.
متن کاملInverse Kinematics by Distance Matrix Completion
INTRODUCTION The Theory of Distance Geometry [1] allows coordinate-free formulations for most position analysis problems. Using such formulations, the inverse kinematics of a serial robot can be performed by using a distance matrix, one whose entries are squared distances between pairs of points selected on the axes of the robot. While some of these distances are known (such as the distances be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 2019
ISSN: 0090-5364
DOI: 10.1214/17-aos1590